Technical Note—Maximal Funnel-Node Flow in an Undirected Network
نویسندگان
چکیده
منابع مشابه
Flow equivalent trees in undirected node-edge-capacitated planar graphs
Given an edge-capacitated undirected graph G = (V ,E,C) with edge capacity c :E → R+, n = |V |, an s − t edge cut C of G is a minimal subset of edges whose removal from G will separate s from t in the resulting graph, and the capacity sum of the edges in C is the cut value of C. A minimum s − t edge cut is an s − t edge cut with the minimum cut value among all s − t edge cuts. A theorem given b...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملNetwork Coding in Undirected Networks
Recent work in network coding shows that, it is necessary to consider both the routing and coding strategies to achieve optimal throughput of information transmission in data networks. So far, most research on network coding has focused on the model of directed networks, where each communication link has a fixed direction. In this paper, we study the benefits of network coding in undirected net...
متن کاملAugmenting undirected node-connectivity by one
We present a min-max formula for the problem of augmenting the nodeconnectivity of a graph by one and give a polynomial time algorithm for finding an optimal solution. We also solve the minimum cost version for node-induced cost functions.
متن کاملComputing All Small Cuts in an Undirected Network
Let (N ) denote the weight of a minimum cut in an edge-weighted undirected network N , and n and m denote the numbers of vertices and edges, respectively. It is known that O(n 2k ) is an upper bound on the number of cuts with weights less than k (N ), where k 1 is a given constant. This paper rst shows that all cuts of weights less than k (N ) can be enumerated in O(m 2 n + n 2k m) time without...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1973
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.21.1.365